例句與造句

1. Like the DFT, the Goertzel algorithm analyses one selectable frequency component from a discrete signal.
2. The particular filtering structure chosen for the Goertzel algorithm is the key to its efficient DFT calculations.
3. The simple structure of the Goertzel algorithm makes it well suited to small processors and embedded applications, though not limited to these.
4. I did a search for " Goertzel " and Wikipedia returned 0 search results, however, there is clearly an article titled " Goertzel algorithm ".
5. The Goertzel algorithm can also be used " in reverse " as a sinusoid synthesis function, which requires only 1 multiplication and 1 subtraction per generated sample.
6. It's difficult to find goertzel algorithm in a sentence. 用goertzel algorithm造句挺難的
7. Unlike direct DFT calculations, the Goertzel algorithm applies a single real-valued coefficient at each iteration, using real-valued arithmetic for real-valued input sequences.
8. However, these gains are natural for the Goertzel algorithm but will not be achieved for the FFT without using certain algorithm variants specialised for transforming real-valued data.
9. For covering a full spectrum, the Goertzel algorithm has a higher order of complexity than fast Fourier transform ( FFT ) algorithms, but for computing a small number of selected frequency components, it is more numerically efficient.
10. :To compute a single DFT bin X ( f ) for a complex input sequence of length N, the Goertzel algorithm requires 2 N multiplications and 4 \ N additions / subtractions within the loop, as well as 4 multiplications and 4 final additions / subtractions, for a total of 2 N + 4 multiplications and 4 N + 4 additions / subtractions.